package LC;

/**
 * https://leetcode.com/problems/number-of-1-bits/description/
 * Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).
 * For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011, so the function should return 3.
 * Credits:
 * Special thanks to @ts for adding this problem and creating all test cases.
 */
public class LC_191_Numberof1Bits_BitManipulation {
    public static void main(String[] args) {
        System.out.println(Solution.hammingWeight(120));
        System.out.println(Integer.toBinaryString(120));
    }

    static class Solution {
        static int hammingWeight(int n) {
            int res = 0;
            while (n != 0) {
                n = n & (n - 1);
                res++;
            }
            return res;
        }
    }
}